PROTOTYPE GENERATION FOR NEAREST NEIGHBOR CLASSIFICATION: SURVEY OF METHODS 1 Prototype Generation for Nearest Neighbor Classification: Survey of Methods
نویسندگان
چکیده
Prototype generation techniques have arisen as very competitive methods for enhancing the nearest neighbor classifier through data reduction. A great number of methods tackling the prototype generation problem have been proposed in the literature. This technical report provides a survey of the most representative algorithms developed so far. A previously proposed categorization has been used to present them and describe their main characteristics, thus providing a first insight into the prototype generation field which may be useful for every practitioner who needs a quick reference about the existing techniques and their particularities.
منابع مشابه
An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملDifferential evolution for optimizing the positioning of prototypes in nearest neighbor classification
Nearest neighbor classification is one of the most used and well known methods in data mining. Its simplest version has several drawbacks, such as low efficiency, high storage requirements and sensitivity to noise. Data reduction techniques have been used to alleviate these shortcomings. Among them, prototype selection and generation techniques have been shown to be very effective. Positioning ...
متن کاملEnhancing IPADE Algorithm with a Different Individual Codification
Nearest neighbor is one of the most used techniques for performing classification tasks. However, its simplest version has several drawbacks, such as low efficiency, storage requirements and sensitivity to noise. Prototype generation is an appropriate process to alleviate these drawbacks that allows the fitting of a data set for nearest neighbor classification. In this work, we present an exten...
متن کاملAsymmetric learning vector quantization for efficient nearest neighbor classification in dynamic time warping spaces
The nearest neighbor method together with the dynamic time warping (DTW) distance is one of the most popular approaches in time series classification. This method suffers from high storage and computation requirements for large training sets. As a solution to both drawbacks, this article extends learning vector quantization (LVQ) from Euclidean spaces to DTW spaces. The proposed LVQ scheme uses...
متن کامل